probability decoding
英 [ˌprɒbəˈbɪləti ˌdiːˈkəʊdɪŋ]
美 [ˌprɑːbəˈbɪləti ˌdiːˈkoʊdɪŋ]
网络 概率译码
双语例句
- Theoretical proved that relative to the random linear network coding, the successful decoding probability of joint block random network coding is increasing, but the decoding time is reduced.
通过理论证明,应用反馈机制后,相对于随机网络编码,联合分块网络编码成功解码的概率提高了,而解码时间复杂度降低了。 - We also use Pearl's probability propagation algorithm to show the appropriateness of the serial decoding method.
采用人工智能中的贝叶斯网络概率传播算法对串行译码方法的合理性给出了证明。 - To fully make use of the information on the deterministic structure of turbo constituent encoders according to the algebraic decoding principle in conjunction with the probabilitic decoding algorithm, this paper proposed a joint probability algebra decoding scheme for turbo codes.
本文在保持Turbo码迭代软解码算法优点的基础上,充分利用Turbo码编码器结构这一确知条件,结合代数解码原理,提出了一种Turbo码概率代数联合解码算法。 - Two novel type of soft-output decoding algorithms for turbo codes with a convolutional interleaver is proposed, based on a decision rule of symbol-by-symbol maximum a posteriori ( MAP) probability. Each of them requires only a forward recursion and has lower decoding delay.
基于最大后验概率判决准则,提出了两种只有前向递推的软输出译码算法,它们具有较低的译码延迟,可用于面向连续比特流的turbo码中。 - Mandarin Digit String Recognition Based on Segment Model Using Posterior Probability Decoding
基于后验概率解码段模型的汉语语音数字串识别 - By a general process named sum-product algorithm that distributed propagate the probability information in the corresponding factor graph, many problems can be solved, and the iterative decoding algorithm of turbo codes can also be viewed as a special instance of sum-product algorithm.
通过在相应因子图上分布地进行概率信息传播的和积算法,可以实现许多问题的求解,Turbo码的迭代译码算法也可以看作是和积算法的一个特例。 - The Viterbi algorithm is known to be an efficient method for the realization of maximum likelihood probability ( MLP) decoding of convolutional codes.
Viterbi译码算法是基于最大似然概率的卷积码译码算法。 - When we are decoding, the two groups of error-correct code can monitor each other, so that, the probability of false-normal decoding is reduced.
解码时,两组纠错码可以相互监督,减少伪正常解码的情况。 - Network coding matrix re-creation mechanism was used to guarantee a100% success probability of decoding.
利用网络编码矩阵重新生成机制以保证100%解码成功率; - It divides the signal constellations into the subsets specified by each binary digit, and then maps the soft symbol information to soft bit information by Maximum-A-posteriori Probability ( MAP) algorithm to realize the binary decoding.
它对每个比特划分对应的星座点集合,然后将对应的符号软信息通过MAP算法映射成为比特软信息的方法,从而实现二进制译码。
